Jagged partitions
نویسندگان
چکیده
By jagged partitions we refer to an ordered collection of non-negative integers (n 1 , n 2 , · · · , n m) with n m ≥ p for some positive integer p, further subject to some weakly decreasing conditions that prevent them for being genuine partitions. The case analyzed in greater detail here corresponds to p = 1 and the following conditions n i ≥ n i+1 − 1 and n i ≥ n i+2. A number of properties for the corresponding partition function are derived, including rather remarkable congruence relations. An interesting application of jagged partitions concerns the derivation of generating functions for enumerating partitions with special restrictions, a point that is illustrated with various examples.
منابع مشابه
Jagged partitions and lattice paths
A lattice-path description of K-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even x coordinate and the maximal value of the height cannot be larger than K − 1. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions. A bijection is given between K-restricted jagged ...
متن کاملConstant Terms, Jagged Partitions, and Partitions with Difference Two at Distance Two
In this paper we establish a group of constant term identities that contain generating functions for “jagged” partitions and interpret these identities as theorems about partitions with difference two at distance two.
متن کاملGenerating Function for K-Restricted Jagged Partitions
We present a natural extension of Andrews’ multiple sums counting partitions of the form (λ1, · · · , λm) with λi ≥ λi+k−1 + 2. The multiple sum that we construct is the generating function for the so-called K-restricted jagged partitions. A jagged partition is a sequence of non-negative integers (n1, n2, · · · , nm) with nm ≥ 1 subject to the weakly decreasing conditions ni ≥ ni+1− 1 and ni ≥ ...
متن کاملLoad-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem,...
متن کاملar X iv : h ep - t h / 04 06 19 4 v 1 2 2 Ju n 20 04 SM ( 2 , 4 κ ) fermionic characters and restricted jagged partitions
A derivation of the basis of states for the SM(2, 4κ) superconformal minimal models is presented. It relies on a general hypothesis concerning the role of the null field of dimension 2κ − 1/2. The basis is expressed solely in terms of G r modes and it takes the form of simple exclusion conditions (being thus a quasi-particle-type basis). Its elements are in correspondence with (2κ − 1)-restrict...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003